La Deduction Relativiste.

Machine Deduction

We present in this paper a new type system which allows to extract code for an abstract machine instead of lambda-terms. Thus, we get a framework to compile correctly programs extracted from proof by translating their proof in our system and then extracting the code. Moreover, we will see that we can associate programs to classical proofs.

Earley Deduction

This paper first reviews Earley Deduction, a generalization of the Earley Parsing Algorithm to the execution of Horn Clause Logic Programs. Earley Deduction is both sound and—unlike the standard Prolog interpreter—complete; proofs of this are included. For functor-free programs, the method is also guaranteed to terminate. (The functor-free subset of Prolog is called DATALOG and can be used to c...

Towards Concurrent Resource Managed Deduction towards Concurrent Resource Managed Deduction

In this paper, we describe an architecture for resource guided concurrent mecha-nised deduction which is motivated by some ndings in cognitive science. Its beneets are illustrated by comparing it with traditional proof search techniques. In particular, we introduce the notion of focused search and show that a reasoning system can be built as the cooperative collection of concurrently acting spe...

Automated Deduction in the B Set Theory using Deduction Modulo

We introduce a new encoding of the set theory of the B method based on deduction modulo. The theory of deduction modulo is an extension of predicate calculus that includes rewriting on both terms and propositions, which is well suited for proof search in axiomatic theories, as it turns many axioms into rewrite rules. We also present Zenon Modulo and iProver Modulo, two automated theorem provers...

Etude sur la digestion pancratique de la caseine pour la production de la toxine tetanique